0.00/0.09 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.09 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM 0.08/0.29 % Computer : n028.cluster.edu 0.08/0.29 % Model : x86_64 x86_64 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.08/0.29 % Memory : 8042.1875MB 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64 0.08/0.29 % CPULimit : 1920 0.08/0.29 % WCLimit : 240 0.08/0.29 % DateTime : Wed Jul 30 02:07:34 EDT 2025 0.08/0.29 % CPUTime : 0.14/0.39 Running higher-order theorem proving 0.14/0.44 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.txtUwNhYLG/E---3.1_2854.p 0.14/0.57 # Version: 3.0.0-ho 0.14/0.57 # Preprocessing class: HSLSSMSSSSMNHFA. 0.14/0.57 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.14/0.57 # Starting pre_casc_2 with 1200s (5) cores 0.14/0.57 # Starting sh3 with 240s (1) cores 0.14/0.57 # Starting new_ho_10_cnf2 with 240s (1) cores 0.14/0.57 # Starting new_bool_3 with 240s (1) cores 0.14/0.57 # new_bool_3 with pid 2936 completed with status 0 0.14/0.57 # Result found by new_bool_3 0.14/0.57 # Preprocessing class: HSLSSMSSSSMNHFA. 0.14/0.57 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.14/0.57 # Starting pre_casc_2 with 1200s (5) cores 0.14/0.57 # Starting sh3 with 240s (1) cores 0.14/0.57 # Starting new_ho_10_cnf2 with 240s (1) cores 0.14/0.57 # Starting new_bool_3 with 240s (1) cores 0.14/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0) 0.14/0.57 # Search class: HGHSM-FSLM32-DHFFFSBN 0.14/0.57 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.14/0.57 # Starting new_ho_10 with 130s (1) cores 0.14/0.57 # new_ho_10 with pid 2937 completed with status 0 0.14/0.57 # Result found by new_ho_10 0.14/0.57 # Preprocessing class: HSLSSMSSSSMNHFA. 0.14/0.57 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.14/0.57 # Starting pre_casc_2 with 1200s (5) cores 0.14/0.57 # Starting sh3 with 240s (1) cores 0.14/0.57 # Starting new_ho_10_cnf2 with 240s (1) cores 0.14/0.57 # Starting new_bool_3 with 240s (1) cores 0.14/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0) 0.14/0.57 # Search class: HGHSM-FSLM32-DHFFFSBN 0.14/0.57 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.14/0.57 # Starting new_ho_10 with 130s (1) cores 0.14/0.57 # Preprocessing time : 0.010 s 0.14/0.57 # Presaturation interreduction done 0.14/0.57 0.14/0.57 # Proof found! 0.14/0.57 # SZS status Theorem 0.14/0.57 # SZS output start CNFRefutation 0.14/0.57 thf(decl_sort1, type, list_list_a: $tType). 0.14/0.57 thf(decl_sort2, type, list_a: $tType). 0.14/0.57 thf(decl_sort3, type, nat: $tType). 0.14/0.57 thf(decl_42, type, listSl1174287072ice2_a: list_a > nat > list_list_a). 0.14/0.57 thf(decl_47, type, listSl97544552lice_a: list_a > nat > list_list_a). 0.14/0.57 thf(decl_82, type, nth_list_a: list_list_a > nat > list_a). 0.14/0.57 thf(decl_97, type, size_size_list_a: list_a > nat). 0.14/0.57 thf(decl_98, type, ord_less_nat: nat > nat > $o). 0.14/0.57 thf(decl_106, type, divide_divide_nat: nat > nat > nat). 0.14/0.57 thf(decl_115, type, k: nat). 0.14/0.57 thf(decl_116, type, m: nat). 0.14/0.57 thf(decl_117, type, xs: list_a). 0.14/0.57 thf(conj_1, conjecture, ((size_size_list_a @ (nth_list_a @ (listSl1174287072ice2_a @ xs @ k) @ m))=(k)), file('/export/starexec/sandbox2/tmp/tmp.txtUwNhYLG/E---3.1_2854.p', conj_1)). 0.14/0.57 thf(fact_19_list__slice2__list__slice__nth, axiom, ![X34:nat, X4:list_a, X13:nat]:(((ord_less_nat @ X34 @ (divide_divide_nat @ (size_size_list_a @ X4) @ X13))=>((nth_list_a @ (listSl1174287072ice2_a @ X4 @ X13) @ X34)=(nth_list_a @ (listSl97544552lice_a @ X4 @ X13) @ X34)))), file('/export/starexec/sandbox2/tmp/tmp.txtUwNhYLG/E---3.1_2854.p', fact_19_list__slice2__list__slice__nth)). 0.14/0.57 thf(fact_30_list__slice__nth__length, axiom, ![X34:nat, X4:list_a, X13:nat]:((((size_size_list_a @ (nth_list_a @ (listSl97544552lice_a @ X4 @ X13) @ X34))=(X13))<=(ord_less_nat @ X34 @ (divide_divide_nat @ (size_size_list_a @ X4) @ X13)))), file('/export/starexec/sandbox2/tmp/tmp.txtUwNhYLG/E---3.1_2854.p', fact_30_list__slice__nth__length)). 0.14/0.57 thf(conj_0, hypothesis, (ord_less_nat @ m @ (divide_divide_nat @ (size_size_list_a @ xs) @ k)), file('/export/starexec/sandbox2/tmp/tmp.txtUwNhYLG/E---3.1_2854.p', conj_0)). 0.14/0.57 thf(c_0_4, negated_conjecture, ((size_size_list_a @ (nth_list_a @ (listSl1174287072ice2_a @ xs @ k) @ m))!=(k)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_1])])). 0.14/0.57 thf(c_0_5, negated_conjecture, ((size_size_list_a @ (nth_list_a @ (listSl1174287072ice2_a @ xs @ k) @ m))!=(k)), inference(fof_nnf,[status(thm)],[c_0_4])). 0.14/0.57 thf(c_0_6, plain, ![X843:nat, X844:list_a, X845:nat]:((~(ord_less_nat @ X843 @ (divide_divide_nat @ (size_size_list_a @ X844) @ X845))|((nth_list_a @ (listSl1174287072ice2_a @ X844 @ X845) @ X843)=(nth_list_a @ (listSl97544552lice_a @ X844 @ X845) @ X843)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_19_list__slice2__list__slice__nth])])])). 0.14/0.57 thf(c_0_7, plain, ![X34:nat, X4:list_a, X13:nat]:(((ord_less_nat @ X34 @ (divide_divide_nat @ (size_size_list_a @ X4) @ X13))=>((size_size_list_a @ (nth_list_a @ (listSl97544552lice_a @ X4 @ X13) @ X34))=(X13)))), inference(fof_simplification,[status(thm)],[fact_30_list__slice__nth__length])). 0.14/0.57 thf(c_0_8, negated_conjecture, ((size_size_list_a @ (nth_list_a @ (listSl1174287072ice2_a @ xs @ k) @ m))!=(k)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.14/0.57 thf(c_0_9, plain, ![X1:nat, X4:list_a, X2:nat]:((((nth_list_a @ (listSl1174287072ice2_a @ X4 @ X2) @ X1)=(nth_list_a @ (listSl97544552lice_a @ X4 @ X2) @ X1))|~((ord_less_nat @ X1 @ (divide_divide_nat @ (size_size_list_a @ X4) @ X2))))), inference(split_conjunct,[status(thm)],[c_0_6])). 0.14/0.57 thf(c_0_10, hypothesis, (ord_less_nat @ m @ (divide_divide_nat @ (size_size_list_a @ xs) @ k)), inference(split_conjunct,[status(thm)],[conj_0])). 0.14/0.57 thf(c_0_11, plain, ![X1038:nat, X1039:list_a, X1040:nat]:((~(ord_less_nat @ X1038 @ (divide_divide_nat @ (size_size_list_a @ X1039) @ X1040))|((size_size_list_a @ (nth_list_a @ (listSl97544552lice_a @ X1039 @ X1040) @ X1038))=(X1040)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])). 0.14/0.57 thf(c_0_12, negated_conjecture, ((size_size_list_a @ (nth_list_a @ (listSl97544552lice_a @ xs @ k) @ m))!=(k)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_9]), c_0_10])])). 0.14/0.57 thf(c_0_13, plain, ![X1:nat, X4:list_a, X2:nat]:((((size_size_list_a @ (nth_list_a @ (listSl97544552lice_a @ X4 @ X2) @ X1))=(X2))|~((ord_less_nat @ X1 @ (divide_divide_nat @ (size_size_list_a @ X4) @ X2))))), inference(split_conjunct,[status(thm)],[c_0_11])). 0.14/0.57 thf(c_0_14, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_10])]), ['proof']). 0.14/0.57 # SZS output end CNFRefutation 0.14/0.57 # Parsed axioms : 462 0.14/0.57 # Removed by relevancy pruning/SinE : 313 0.14/0.57 # Initial clauses : 414 0.14/0.57 # Removed in clause preprocessing : 10 0.14/0.57 # Initial clauses in saturation : 404 0.14/0.57 # Processed clauses : 517 0.14/0.57 # ...of these trivial : 4 0.14/0.57 # ...subsumed : 129 0.14/0.57 # ...remaining for further processing : 384 0.14/0.57 # Other redundant clauses eliminated : 35 0.14/0.57 # Clauses deleted for lack of memory : 0 0.14/0.57 # Backward-subsumed : 0 0.14/0.57 # Backward-rewritten : 0 0.14/0.57 # Generated clauses : 164 0.14/0.57 # ...of the previous two non-redundant : 145 0.14/0.57 # ...aggressively subsumed : 0 0.14/0.57 # Contextual simplify-reflections : 1 0.14/0.57 # Paramodulations : 99 0.14/0.57 # Factorizations : 2 0.14/0.57 # NegExts : 0 0.14/0.57 # Equation resolutions : 36 0.14/0.57 # Disequality decompositions : 0 0.14/0.57 # Total rewrite steps : 15 0.14/0.57 # ...of those cached : 7 0.14/0.57 # Propositional unsat checks : 0 0.14/0.57 # Propositional check models : 0 0.14/0.57 # Propositional check unsatisfiable : 0 0.14/0.57 # Propositional clauses : 0 0.14/0.57 # Propositional clauses after purity: 0 0.14/0.57 # Propositional unsat core size : 0 0.14/0.57 # Propositional preprocessing time : 0.000 0.14/0.57 # Propositional encoding time : 0.000 0.14/0.57 # Propositional solver time : 0.000 0.14/0.57 # Success case prop preproc time : 0.000 0.14/0.57 # Success case prop encoding time : 0.000 0.14/0.57 # Success case prop solver time : 0.000 0.14/0.57 # Current number of processed clauses : 79 0.14/0.57 # Positive orientable unit clauses : 24 0.14/0.57 # Positive unorientable unit clauses: 0 0.14/0.57 # Negative unit clauses : 16 0.14/0.57 # Non-unit-clauses : 39 0.14/0.57 # Current number of unprocessed clauses: 304 0.14/0.57 # ...number of literals in the above : 1472 0.14/0.57 # Current number of archived formulas : 0 0.14/0.57 # Current number of archived clauses : 272 0.14/0.57 # Clause-clause subsumption calls (NU) : 17517 0.14/0.57 # Rec. Clause-clause subsumption calls : 3315 0.14/0.57 # Non-unit clause-clause subsumptions : 123 0.14/0.57 # Unit Clause-clause subsumption calls : 290 0.14/0.57 # Rewrite failures with RHS unbound : 0 0.14/0.57 # BW rewrite match attempts : 13 0.14/0.57 # BW rewrite match successes : 4 0.14/0.57 # Condensation attempts : 517 0.14/0.57 # Condensation successes : 12 0.14/0.57 # Termbank termtop insertions : 74033 0.14/0.57 # Search garbage collected termcells : 9658 0.14/0.57 0.14/0.57 # ------------------------------------------------- 0.14/0.57 # User time : 0.084 s 0.14/0.57 # System time : 0.013 s 0.14/0.57 # Total time : 0.097 s 0.14/0.57 # Maximum resident set size: 3816 pages 0.14/0.57 0.14/0.57 # ------------------------------------------------- 0.14/0.57 # User time : 0.097 s 0.14/0.57 # System time : 0.015 s 0.14/0.57 # Total time : 0.112 s 0.14/0.57 # Maximum resident set size: 2600 pages 0.14/0.57 % E exiting 0.14/0.57 % E exiting 0.14/0.57 EOF